منابع مشابه
Weak Convergence of Mann Iterative Algorithm for two Nonexpansive mappings
The mann fixed point algorithm play an importmant role in the approximation of fixed points of nonexpansive operators. In this paper, by considering new conditions, we prove the weak convergence of mann fixed point algorithm, for finding a common fixed point of two nonexpansive mappings in real Hilbert spaces. This results extend the privious results given by Kanzow and Shehu. Finally, we give ...
متن کاملAn Iterative Substructuring Algorithm for Problems in Three Dimensions
In domain decomposition algorithms with more than a few subdomains, there is a crucial need for a mechanism to provide for global communication of information at each step of the iterative process. The convergence rate will decay rapidly with an increasing number of subdomains if communication is only between neighboring subdomains. For iterative substructuring algorithms (those domain decompos...
متن کاملThree-dimensional holographic lithography by an iterative algorithm.
We have applied an iterative algorithm for hologram design with multiple output image planes arranged in close proximity to create continuous patterns within an imaging volume. These holograms have been designed for photolithography on three-dimensional surfaces. The influence of simulated image plane separation on the final image, and its suitability for lithography, is assessed. Results are p...
متن کاملComparing Three Footprint Grades to Evaluate Footprint Indexes for Flat Foot Diagnosis
Purpose: The present study investigated the most appropriate footprint index and its related parameters for the diagnosis of flatfoot, especially in cases with mild deformity. Methods: In total, 148 footprints were recorded from 77 young women with flatfoot. Footprints were classified into three groups of mild, moderate, and sever. Footprint indexes included Sztriter-Godunov (KY), Clarke’s Ang...
متن کاملIterative Scaling Algorithm for Channels
Here we define a procedure for evaluating KL-projections (Iand rIprojections) of channels. These can be useful in the decomposition of mutual information between input and outputs, e.g. to quantify synergies and interactions of different orders, as well as information integration and other related measures of complexity. The algorithm is a generalization of the standard iterative scaling algori...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optics Express
سال: 2007
ISSN: 1094-4087
DOI: 10.1364/oe.15.006809